Tight Lower Bounds on the Approximability of Some NPO PB Complete Problems
نویسندگان
چکیده
We investigate the approximability of the NPO PB complete problems Min Ones Min Dones Max Ones Max Dones and Max PB Programming We show that unless P NP these problems are not approximable within n for any where n is the number of variables in the input Since all of these problems are approximable within n this lower bound is close to optimal
منابع مشابه
Strong Lower Bounds on the Approximability of some NPO PB-Complete Maximization Problems
The approximability of several NP maximization problems is investigated and strong lower bounds for the studied problems are proved. For some of the problems the bounds are the best that can be achieved, unless P = NP. For example we investigate the approximability of Max PB 0 ? 1 Programming, the problem of nding a binary vector x that satisses a set of linear relations such that the objective...
متن کاملLinkk Oping Electronic Articles in Tight Lower Bounds on the Approximability of Some Npo Pb-complete Problems Linkk Oping Electronic Articles in Computer and Information Science
The publishers will keep this article on-line on the Internet (or its possible replacement network in the future) for a period of 25 years from the date of publication, barring exceptional circumstances as described separately. The on-line availability of the article implies a permanent permission for anyone to read the article on-line, to print out single copies of it, and to use it unchanged ...
متن کاملPolynomially Bounded Minimization Problems which are Hard to Approximate
Min PB is the class of minimization problems whose objective functions are bounded by a polynomial in the size of the input. We show that there exist several problems that are Min PB-complete with respect to an approximation preserving reduction. These problems are very hard to approximate; in polynomial time they cannot be approximated within nε for some ε > 0, where n is the size of the input...
متن کاملNear-Optimal Nonapproximability Results for Some NPO PB-Complete Problems
We show that a number of Npo PB-complete problems, including Min Ones and Max Ones, are hard to approximate within n 1? for arbitrary > 0.
متن کاملOn the Approximability of the Maximum Common Subgraph Problem
Some versions of the maximum common subgraph problem are studied and approximation algorithms are given. The maximum bounded common induced subgraph problem is shown to be Max SNP-hard and the maximum unbounded common induced subgraph problem is shown to be as hard to approximate as the maximum independent set problem. The maximum common induced connected subgraph problem is still harder to app...
متن کامل